Expurgated bounds, bhattacharyya distance, and rate distortion functions
نویسندگان
چکیده
منابع مشابه
Rate Distortion Functions and Rate Distortion Function Lower Bounds for Real-World Sources
Although Shannon introduced the concept of a rate distortion function in 1948, only in the last decade has the methodology for developing rate distortion function lower bounds for real-world sources been established. However, these recent results have not been fully exploited due to some confusion about how these new rate distortion bounds, once they are obtained, should be interpreted and shou...
متن کاملBhattacharyya distance feature selection
A recursive algorithm named Bhattacharyya distance feature selection for selecting a real-optimum feature under normal multidistribution is presented. The key of this method is to change the problem of minimizing the criterion of sum of the upper bound of error probability of every two class pair in subspace to a problem of solving nonlinear matrix equation in multiclass problem under orthonorm...
متن کاملRate Distortion Bounds for Voice and Video
Numerous voice, still image, audio, and video compression standards have been developed over the last 25 years, and significant advances in the state of the art have been achieved. However, in the more than 50 years since Shannon’s seminal 1959 paper, no rate distortion bounds for voice and video have been forthcoming. In this volume, we present the first rate distortion bounds for voice and vi...
متن کاملRate-Distortion Bounds for an Epsilon-Insensitive Distortion Measure
Direct evaluation of the rate-distortion function has rarely been achieved when it is strictly greater than its Shannon lower bound. In this paper, we consider the rate-distortion function for the distortion measure defined by an ε-insensitive loss function. We first present the Shannon lower bound applicable to any source distribution with finite differential entropy. Then, focusing on the Lap...
متن کاملRate-Distortion Bounds for Kernel-Based Distortion Measures
Kernel methods have been used for turning linear learning algorithms into nonlinear ones. These nonlinear algorithms measure distances between data points by the distance in the kernel-induced feature space. In lossy data compression, the optimal tradeoff between the number of quantized points and the incurred distortion is characterized by the rate-distortion function. However, the rate-distor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1974
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(74)80060-4